Dual Identities / Masking

نویسندگان

چکیده

An array of Egyptian and Tunisian lifeworlds in 2016.
 Re-published (with minor modifications, mainly the cross-references) from JAIS 17 (2017): 484-91.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Infinite Family of Dual Sequence Identities

We subsume three identities of Sun [2] into an infinite family of identities, and consider some special cases.

متن کامل

Combinatorial Identities in Dual Sequences 3

In this paper we derive a general combinatorial identity in terms of polynomials with dual sequences of coefficients. Moreover, combinatorial identities involving Bernoulli and Euler polynomials are deduced. Also, various other known identities are obtained as particular cases.

متن کامل

Dual Moving Text Line Detection and Selective Masking

In this paper we are proposing a technique to extract a moving text-line in a video and split if there are dual moving text-line in it. In second stage we mask the one or both moving text-line to secure the information or to avoid the unnecessary information. In third stage the extracted moving text-line is inserted at different location of the video-frame if required. This simulation work is d...

متن کامل

Masking and Dual-Rail Logic Don't Add Up

Masked logic styles use a random mask bit to de-correlate the power consumption of the circuit from the state of the algorithm. The effect of the random mask bit is that the circuit switches between two complementary states with a different power profile. Earlier work has shown that the mask-bit value can be estimated from the power consumption profile, and that masked logic remains susceptible...

متن کامل

WEIGHT POLYNOMIALS OF SELF-DUAL CODES AND THE MacWILLIAMS IDENTITIES

Many error correcting codes are known to be self-dual. Hence the MacWilliams identities put a considerable restriction on the possible weight distribution of such a code. We show that this restriction, for codes over GF(2) and GF(3), is that the weight polynomial must lie in an explicitly described free polynomial ring. To extend these results (in part) to self-dual codes over larger fields, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Arabic and Islamic Studies

سال: 2021

ISSN: ['0806-198X']

DOI: https://doi.org/10.5617/jais.9499